Nondeterministic stack register machines
نویسندگان
چکیده
منابع مشابه
Global Stack Allocation – Register Allocation for Stack Machines
Register allocation is a critical part of any compiler, yet register allocation for stack machines has received relatively little attention in the past. We present a framework for the analysis of register allocation methods for stack machines which has allowed us to analyse current methods. We have used this framework to design the first truly procedure-wide register allocation methods for stac...
متن کاملLearning Nondeterministic Mealy Machines
In applications where abstract models of reactive systems are to be inferred, one important challenge is that the behavior of such systems can be inherently nondeterministic. To cope with this challenge, we developed an algorithm to infer nondeterministic computation models in the form of Mealy machines. We introduce our approach and provide extensive experimental results to assess its potentia...
متن کاملLearning Nondeterministic Register Automata Using Mappers
We present a new algorithm for active learning of register automata. Our algorithm uses counterexample-guided abstraction refinement to automatically construct a component which maps (in a history dependent manner) the large set of actions of an implementation into a small set of actions that can be handled by a Mealy machine learner. The class of register automata that is handled by our algori...
متن کاملA Performance Survey on Stack-based and Register-based Virtual Machines
Virtual machines have been widely adapted for high-level programming language implementations and for providing a degree of platform neutrality. As the overall use and adaptation of virtual machines grow, the overall performance of virtual machines has become a widely-discussed topic. In this paper, we present a survey on the performance differences of the two most widely adapted types of virtu...
متن کاملInfinite Time Register Machines
Infinite time register machines (ITRMs) are register machines which act on natural numbers and which may run for arbitrarily many ordinal steps. Successor steps are determined by standard register machine commands, at limits the register contents are defined as lim inf’s of the previous register contents. We prove that a real number is computable by an ITRM iff it is hyperarithmetic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00051-5